package edu.whut.recursion;
/*
* 斐波那契数列
* 1 1 2 3 5 8
* */
public class RecursionDemo03 {
    public static void main(String[] args) {
        System.out.println(fbi(8));
    }
    public  static int fbi(int n){
        if (n==1||n==2) return 1;
        else return fbi(n-1)+fbi(n-2);
    }
}
